Pascal-Francis CNRS

Pascal and Francis Bibliographic Databases

Help

Search results

Your search

au.\*:("GRONAU, Hans-Dietrich")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Origin

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 77

  • Page / 4
Export

Selection :

  • and

Orthogonal double covers of Kn, n by small graphsEL-SHANAWANY, Ramadan; GRONAU, Hans-Dietrich O. F; GRÜTTMÜLLER, Martin et al.Discrete applied mathematics. 2004, Vol 138, Num 1-2, pp 47-63, issn 0166-218X, 17 p.Conference Paper

Orthogonal covers by multiplication graphsGRONAU, Hans-Dietrich O. F; SCHMIDMEIER, Markus.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2048-2056, issn 0166-218X, 9 p.Conference Paper

Proceedings of the Conference on Optimal Discrete Structures and Algorithms, ODSA '97, 8-10 September 1997, Rostock, GermanyBRANDSTÄDT, Andreas; ENGEL, Konrad; GRONAU, Hans-Dietrich et al.Discrete applied mathematics. 1999, Vol 95, Num 1-3, issn 0166-218X, 471 p.Conference Proceedings

Optimal Discrete Structures and Algorithms ODSA 2006BRANDSTÄDT, Andreas; ENGEL, Konrad; GRONAU, Hans-Dietrich et al.Discrete applied mathematics. 2009, Vol 157, Num 9, issn 0166-218X, 241 p.Conference Proceedings

Optimal Discrete Structures and Algorithms (ODSA 2000), Rostock, Germany, September 11-13, 2000BRANDSTÄDT, Andreas; ENGEL, Konrad; GRONAU, Hans-Dietrich et al.Discrete applied mathematics. 2004, Vol 138, Num 1-2, issn 0166-218X, 254 p.Conference Proceedings

Integral point sets over ℤmnKOHNERT, Axel; KURZ, Sascha.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2105-2117, issn 0166-218X, 13 p.Conference Paper

Relaxation procedures on graphsWEGERT, Elias; REIHER, Christian.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2207-2216, issn 0166-218X, 10 p.Conference Paper

t-wise balanced designsLAUE, Reinhard.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2136-2142, issn 0166-218X, 7 p.Conference Paper

Recognizing quasi-triangulated graphsSPINRAD, Jeremy P.Discrete applied mathematics. 2004, Vol 138, Num 1-2, pp 203-213, issn 0166-218X, 11 p.Conference Paper

Upper bounds for covering arrays by tabu searchNURMELA, Kari J.Discrete applied mathematics. 2004, Vol 138, Num 1-2, pp 143-152, issn 0166-218X, 10 p.Conference Paper

Note on a helicopter search problem on graphsFOMIN, F. V.Discrete applied mathematics. 1999, Vol 95, Num 1-3, pp 241-249, issn 0166-218XConference Paper

On the p-connectedness of graphs: a surveyBABEL, L; OLARIU, S.Discrete applied mathematics. 1999, Vol 95, Num 1-3, pp 11-33, issn 0166-218XConference Paper

The Steiner ratio of L2kdCIESLIK, D.Discrete applied mathematics. 1999, Vol 95, Num 1-3, pp 217-221, issn 0166-218XConference Paper

An approximation algorithm for multidimensional assignment problems minimizing the sum of squared errorsKUROKI, Yusuke; MATSUI, Tomomi.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2124-2135, issn 0166-218X, 12 p.Conference Paper

Optimal matrix-segmentation by rectanglesENGEL, Konrad.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2015-2030, issn 0166-218X, 16 p.Conference Paper

Bdds-design, analysis, complexity, and applicationsWEGENER, Ingo.Discrete applied mathematics. 2004, Vol 138, Num 1-2, pp 229-251, issn 0166-218X, 23 p.Conference Paper

The bisection width and the isoperimetric number of arraysCEMIL AZIZOGLU, M; EGECIOGLU, Ömer.Discrete applied mathematics. 2004, Vol 138, Num 1-2, pp 3-12, issn 0166-218X, 10 p.Conference Paper

Critical edges in perfect line graphs and some polyhedral consequencesWAGLER, A.Discrete applied mathematics. 1999, Vol 95, Num 1-3, pp 455-466, issn 0166-218XConference Paper

On the complexity of hamiltonian path and cycle problems in certain classes of digraphsBANG-JENSEN, J; GUTIN, G.Discrete applied mathematics. 1999, Vol 95, Num 1-3, pp 41-60, issn 0166-218XConference Paper

Orthogonal double covers of complete graphs by trees of small diameterLECK, U; LECK, V.Discrete applied mathematics. 1999, Vol 95, Num 1-3, pp 377-388, issn 0166-218XConference Paper

Dynamically maintaining split graphsHEGGERNES, Pinar; MANCINI, Federico.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2057-2069, issn 0166-218X, 13 p.Conference Paper

Online scheduling with general machine cost functionsIMREH, Cs.Discrete applied mathematics. 2009, Vol 157, Num 9, pp 2070-2077, issn 0166-218X, 8 p.Conference Paper

The Steiner ratio of high-dimensional Banach-Minkowski spacesCIESLIK, Dietmar.Discrete applied mathematics. 2004, Vol 138, Num 1-2, pp 29-34, issn 0166-218X, 6 p.Conference Paper

An upper bound for the size of the largest antichain in the poset of partitions of an integerCANFIELD, E. R; ENGEL, K.Discrete applied mathematics. 1999, Vol 95, Num 1-3, pp 169-180, issn 0166-218XConference Paper

Graph classes between parity and distance-hereditary graphsCICERONE, S; DI STEFANO, G.Discrete applied mathematics. 1999, Vol 95, Num 1-3, pp 197-216, issn 0166-218XConference Paper

  • Page / 4